Multidimensional Web Access Pattern Tree (MD-WAP Tree)
نویسندگان
چکیده
منابع مشابه
Multidimensional Web Access Pattern Tree (MD-WAP Tree)
Mining frequent web access patterns from large data (web log) is one significant application of sequential pattern mining. Web access patterns are set of frequent sub sequences that are useful to know user behaviour in real time in order to make dynamic decisions. Techniques for extracting web access patterns from data available in two flavours: apriori based and non apriori based (tree based)....
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملBinary Coded Web Access Pattern Tree in Education Domain
Web Access Pattern (WAP), which is the sequence of accesses pursued by users frequently, is a kind of interesting and useful knowledge in practice. Sequential Pattern mining is the process of applying data mining techniques to a sequential database for the purposes of discovering the correlation relationships that exist among an ordered list of events. WAP tree mining is a sequential pattern mi...
متن کاملA Web Log Frequent Sequential Pattern Mining Algorithm Linked WAP-Tree
Web log frequent sequence pattern mining is an important field of Web log mining and of discovering interactive frequent sequence pattern between users and websites. It is easy to analyse users’ access sequence patterns by utilizing these sequence patterns and it is meaningful to build an intelligent website by mining Web log frequent sequential patterns. The PREWAP algorithm proposed in the pa...
متن کاملPosition Coded Pre-order Linked WAP-Tree for Web Log Sequential Pattern Mining
Web access pattern tree algorithm mines web log access sequences by first storing the original web access sequence database on a prefix tree (WAP-tree). WAP-tree algorithm then mines frequent sequences from the WAP-tree by recursively re-constructing intermediate WAP-trees, starting with their suffix subsequences. This paper proposes an efficient approach for using the preorder linked WAP-trees...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2016
ISSN: 0975-8887
DOI: 10.5120/ijca2016909472